simulated solution

См. также в других словарях:

• Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… …   Wikipedia

• simulated annealing — noun A randomized improvement algorithm, analagous to the metalworking process annealing. For this problem, the simulated annealing based heuristic provides a near optimal solution …   Wiktionary

• Buffer solution — Acids and Bases Acid dissociation constant Acid base extraction Acid–base reaction Acid–base titration Dissociation constant Acidity function B …   Wikipedia

• модельный раствор — имитирующий раствор — [А.С.Гольдберг. Англо русский энергетический словарь. 2006 г.] Тематики энергетика в целом Синонимы имитирующий раствор EN simulated solution …   Справочник технического переводчика

• Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

• Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… …   Wikipedia

• Ant colony optimization — The ant colony optimization algorithm (ACO), introduced by Marco Dorigo in 1992 in his PhD thesis, is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. They are inspired by the …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… …   Wikipedia

• Raymond Kurzweil — Infobox Person name = Raymond Kurzweil image size = 250px caption = Raymond Kurzweil birth date = Birth date and age|1948|2|12|mf=y birth place = Queens, New York, United States death date = death place = height = 5 7 weight = 145 lbs occupation …   Wikipedia

• Monte Carlo methods in finance — Monte Carlo methods are used in finance and mathematical finance to value and analyze (complex) instruments, portfolios and investments by simulating the various sources of uncertainty affecting their value, and then determining their average… …   Wikipedia